Nonmonotonicity and Partiality in Defeasible Argumentation*
نویسنده
چکیده
This chapter is concerned with nonmonotonicity and partiality in the theory of defeasible argumentation. In this theory, a defeasible proof (or argument) establishes warrant for a conclusion only if it is not defeated by better counterarguments. We introduce a formal theory of argumentation, in which the notion of abstract argumentation system is paramount. After that, we discuss the significance of studying general properties of warrant, and argue why most of these properties, notably cumulativity, fail to hold for even the most straightforward patterns of nonmonotonic reasoning. We even go as far as to claim that nonmonotonic entailment is characterised by nothing but nonmonotonicity. A theory of warrant declares which argument is in force and which is not, and might therefore be considered to comprise a declarative semantics. Even an ardent proponent of procedural argumentation would have little trouble with this statement. In addition, however, we state that a theory of warrant also comprises a model theoretic semantics. Knowing that some followers of the procedural school have balked at this, we support our claim by proving our version of warrant equivalent to a model theoretic partial semantics. We conclude by telling what procedural argumentation is supposed to be.
منابع مشابه
Reasoning with Defeasible Arguments: Examples and Applications
This paper attempts to demonstrate the wide variety of characteristic properties of defeasible argumentation, of which nonmonotonicity is one. To do so, we introduce a simple formalism, called abstract argumentation system, with which we discuss different methods for raising arguments: forward reasoning, backward reasoning and, in particular, combinations thereof. Resource-bounded defeasible re...
متن کاملThe Influence of Defeated Arguments in Defeasible Argumentation
Formal defeasible argumentation is currently the subject of active research. Formalisms of defeasible argumentation are characterized by a notion of defeasible argument. The influence of arguments on which conclusions can be drawn distinguishes formalisms of defeasible argumentation from nonmonotonic logics. This influence occurs for two reasons: by the structure of an argument, and by interact...
متن کاملArgumentation Semantics for Defeasible Logic
Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It haspowerful implementations and shows promise to be applied in the areas of legal reasoning and themodeling of business rules. This paper establishes significant links between defeasible reasoning andargumentation. In particular, Dung-like argumentation semantics is provided for two key ...
متن کاملAn Argumentation-Theoretic Characterization of Defeasible Logic
Defeasible logic is an efficient non-monotonic logic that is defined only proof-theoretically. It has potential application in some legal domains. We present here an argumentation semantics for defeasible logic that will be useful in these applications. Our development differs at several points from existing argumentation frameworks since there are several features of defeasible logic that have...
متن کاملRelating Concrete Argumentation Formalisms and Abstract Argumentation
There are a wide variety of formalisms for defeasible reasoning that can be seen as implementing concrete argumentation on defeasible rules. However there has been little work on the relationship between such languages and Dung’s abstract argumentation. In this paper we identify two small fragments on which many concrete defeasible formalisms agree. The two fragments are closely related, as we ...
متن کامل